Lifted projective Reed–Solomon codes

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Locality via Partially Lifted Codes

In error-correcting codes, locality refers to several different ways of quantifying how easily a small amount of information can be recovered from encoded data. In this work, we study a notion of locality called the s-Disjoint-Repair-Group Property (s-DRGP). This notion can interpolate between two very different settings in coding theory: that of Locally Correctable Codes (LCCs) when s is large...

متن کامل

Absolutely Sound Testing of Lifted Codes

In this work we present a strong analysis of the testability of a broad, and to date the most interesting known, class of “affine-invariant” codes. Affine-invariant codes are codes whose coordinates are associated with a vector space and are invariant under affine transformations of the coordinate space. Affine-invariant linear codes form a natural abstraction of algebraic properties such as li...

متن کامل

Projective Reed - Muller Codes

R~sum~. On inlroduit une classe de codes lintaires de la famille des codes de Reed-Muller, les codes de Reed-Muller projectifs. Ces codes sont des extensions des codes de Reed-Muller gtntralists ; les codes de Reed-Muller projectifs d'ordre I atteignent la borne de Plotkin. On donne les traram&res des codes de Reed-Muller projecfifs d'ordre 2. 1.Introduction We note pm(Fq) the projective space ...

متن کامل

Projective parameterized linear codes

In this paper we estimate the main parameters of some evaluation codes which are known as projective parameterized codes. We find the length of these codes and we give a formula for the dimension in terms of the Hilbert function associated to two ideals, one of them being the vanishing ideal of the projective torus. Also we find an upper bound for the minimum distance and, in some cases, we giv...

متن کامل

Codes and Projective Multisets

The paper gives a matrix-free presentation of the correspondence between full-length linear codes and projective multisets. It generalizes the BrouwerVan Eupen construction that transforms projective codes into two-weight codes. Short proofs of known theorems are obtained. A new notion of self-duality in coding theory is explored. 94B05, 94B27, 51E22.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Designs, Codes and Cryptography

سال: 2018

ISSN: 0925-1022,1573-7586

DOI: 10.1007/s10623-018-0552-8